Programming Research Group DYNAMIC DATA STRUCTURES : THE BSP
نویسندگان
چکیده
In this work we present eecient and practical randomized data structures on the Bulk-Synchronous Parallel (BSP) model of computation along with an experimental study of their performance. In particular, we study data structures for the realization of Parallel Priority Queues (PPQs) and Parallel Dictionaries (PDs). We show that our algorithms are communication eecient and achieve optimality to within small multiplicative constant factors for a wide range of parallel machines. We also present an experimental study of our PPQ algorithms on a variety of parallel platforms, including the SGI Power Challenge and the Cray T3D.
منابع مشابه
Programming Research Group CONCURRENT HEAPS ON THE BSP MODEL
In this paper we present a new randomized selection algorithm on the Bulk-Synchronous Parallel (BSP) model of computation along with an application of this algorithm to dynamic data structures, namely Parallel Priority Queues (PPQs). We show that our algorithms improve previous results upon both the communication requirements and the amount of parallel slack required to achieve optimal performa...
متن کاملProgramming Research Group COMMUNICATION EFFICIENT DATA STRUCTURES ON THE BSP MODEL WITH APPLICATIONS
The implementation of data structures on distributed memory models such as the Bulk-Synchronous Parallel (BSP) model, rather than shared memory ones such as the PRAM, ooers a serious challenge. In this work we undertake the architecture independent study of the communication and synchronization requirements of searching ordered h-level graphs, which include most of the standard data structures....
متن کاملProgramming Research Group BSP SCHEDULING OF REGULAR PATTERNS OF COMPUTATION
One of the major challenges of the current research in the eld of parallel computing is the development of a realistic underlying framework for the design and programming of general purpose parallel computers. The bulk-synchronous parallel (BSP) model is largely viewed as the most suitable candidate for this role, as it ooers support for both the design of scalable parallel architectures and th...
متن کاملProgramming Research Group A SCHEME FOR THE BSP SCHEDULING OF GENERIC LOOP NESTS
This report presents a scheme for the bulk-synchronous parallel (BSP) scheduling of generic, untightly nested loops. Being targeted at the BSP model of computation, the novel parallelisation scheme yields parallel code which is scalable, portable, and whose cost can be accurately analysed. The scheme comprises three stages: data dependence analysis and potential parallelism identiication, data ...
متن کاملMeasuring a Dynamic Efficiency Based on MONLP Model under DEA Control
Data envelopment analysis (DEA) is a common technique in measuring the relative efficiency of a set of decision making units (DMUs) with multiple inputs and multiple outputs. Standard DEA models are quite limited models, in the sense that they do not consider a DMU at different times. To resolve this problem, DEA models with dynamic structures have been proposed.In a recent pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997